Planning with Numerical Expressions in LPG
نویسندگان
چکیده
We present some techniques for handling planning problems with numerical expressions that can be specified using the standard planning language PDDL. These techniques are implemented in LPG, a fully-automated planner based on local search that was awarded at the third international planning competition (2002). First, we present a plan representation for handling numerical expressions called Numerical Action Graph (NA-graph). Then, we propose some extensions of LPG to guide a search process where the search states are NA-graphs. Finally, we give some experimental results showing that our techniques are very effective in terms of CPU-time or plan quality, and that they significantly improve the previous version of
منابع مشابه
LPG-TD: a Fully Automated Planner for PDDL2.2 Domains
Like the previous version of LPG, the new version is based on a stochastic local search in the space of particular “action graphs” derived from the planning problem specification. In LPG-TD, this graph representation has been extended to deal with the new features of PDDL2.2, as well to improve the management of durative actions and of numerical expressions (already supported by PDDL2.1 (Fox & ...
متن کاملPlanning Through Stochastic Local Search and Temporal Action Graphs in LPG
We present some techniques for planning in domains specified with the recent standard language pddl2.1, supporting “durative actions” and numerical quantities. These techniques are implemented in lpg, a domain-independent planner that took part in the 3rd International Planning Competition (IPC). lpg is an incremental, any time system producing multi-criteria quality plans. The core of the syst...
متن کاملLPG: A Planner Based on Local Search for Planning Graphs with Action Costs
We present LPG, a fast planner using local search for solving planning graphs. LPG can use various heuristics based on a parametrized objective function. These parameters weight different types of inconsistencies in the partial plan represented by the current search state, and are dynamically evaluated during search using Lagrange multipliers. LPG’s basic heuristic was inspired by Walksat, whic...
متن کاملPlanning in Supply Chain Optimization Problem
The SCO planning problem is a tightly coupled planning and scheduling problem. We have identified some important features underlying this problem including the coordination between actions, maintaining temporal and numerical constraints and the optimization metric. These features have been modeled separately and experimented with the state-of-the-art planners, Crikey, Lpg-td and SgPlan5. Howeve...
متن کاملLocal Search Techniques for Temporal Planning in LPG
We present some techniques for planning in temporal domains specified with the recent standard languange PDDL2.1. These techniques are implemented in LPG, a fully-automated system that took part in the third International Planning Competition (Toulouse, 2002) showing excellent performance. The planner is based on a stochastic local search method and on a graph-based representation called “Tempo...
متن کامل